Contrasat – A Contrarian SAT Solver system description
نویسندگان
چکیده
The SAT solver Contrasat is a small variation of the well-established Minisat solver. It was entered in the Minisat hack track of the 2011 SAT competition, and was judged to be first place in one category. This paper describes the code change and its motivation. The characterization as “contrarian” is explained. Experimental results are summarized.
منابع مشابه
Contrasat - A Contrarian SAT Solver
The SAT solver Contrasat is a small variation of the well-established Minisat solver. It was entered in the Minisat hack track of the 2011 SAT competition, and was judged to be first place in one category. This paper describes the code change and its motivation. The characterization as “contrarian” is explained. Experimental results are summarized.
متن کاملLingeling, Plingeling and Treengeling Entering the SAT Competition 2013
This paper serves as solver description for our SAT solver Lingeling and its two parallel variants Treengeling and Plingeling entering the SAT Competition 2013. We only list important differences to the version of these solvers used in the SAT Challenge 2012. For further information we refer to the solver description [1] of the SAT Challenge 2012 or source code.
متن کاملArgoLib v3.5: System Description for SMTComp’07∗
SAT solver. DPLL(X) part of the system is based on our SAT solver called argosat. argo-sat is a rational reconstruction of the MiniSat solver [3]. The main design goal of argo-sat was to improve code readability and flexibility of MiniSat without affecting its performance. This makes experimenting in the field of SAT research easier, and also enables us to formally prove the correctness of the ...
متن کاملYet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014
This paper serves as solver description for the SAT solvers Lingeling and its two parallel variants Treengeling and Plingeling, as well as for our new local search solver YalSAT entering the Competition 2014. For Lingeling and its variants we only list important differences to earlier version of these solvers as used in the SAT Competition 2013. For further information we refer to the solver de...
متن کاملSAT Solver verification
This document contains formall correctness proofs of modern SAT solvers. Two different approaches are used — state-transition systems and shallow embedding into HOL. Formalization based on state-transition systems follows [1, 3]. Several different SAT solver descriptions are given and their partial correctness and termination is proved. These include: 1. a solver based on classical DPLL procedu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012